This letter shows that linear Cellular Automata based on rules 90/150generate all the solutions of linear difference equations with binary constantcoefficients. Some of these solutions are pseudo-random noise sequences withapplication in cryptography: the sequences generated by the class of shrinkinggenerators. Consequently, this contribution show that shrinking generators donot provide enough guarantees to be used for encryption purposes. Furthermore,the linearization is achieved through a simple algorithm about which a fulldescription is provided.
展开▼
